A Multiresolution Vector Data Compression Algorithm Based on Space Division
نویسندگان
چکیده
منابع مشابه
Collaboration space division in collaborative product development based on a genetic algorithm
The advance in the global environment, rapidly changing markets, and information technology has created a new stage for design. In such an environment, one strategy for success is the Collaborative Product Development (CPD). Organizing people effectively is the goal of Collaborative Product Development, and it solves the problem with certain foreseeability. The development group activities are ...
متن کاملDWT Foveation-Based Multiresolution Compression Algorithm
Abstract – Discrete Wavelet Transform (DWT) foveated compression can be used in real-time video processing frameworks for reducing the communication overhead. Such algorithms lead into high rate compression results due to the fact that the information loss is isolated outside a region of interest (ROI). The fovea compression can also be applied to other classic transforms such as the commonly u...
متن کاملData compression of multiresolution surfaces
In this paper we introduce a new compressed representation for multiresolution models (MRM) of triangulated surfaces of 3D-objects. Associated with the representation we present compression and decompression algorithms. Our representation allows us to extract the surface at variable resolution in time linear in the output size. It applies to MRMs generated by di erent simpli cation algorithms l...
متن کاملMultiresolution Decomposition Based Data Compression with B - Splines
A new multiresolution decomposition scheme based on constrained B-Spline decimation/interpolation is proposed. The proposed decomposition algorithm is tested on greyscale and color image compression, and the results are compared with DCT based compression. Dithering and postprocessing are applied to the compressed images to deal with artifacts at low bit rate compression.
متن کاملA Space-Saving Approximation Algorithm for Grammar-Based Compression
A space-efficient approximation algorithm for the grammar-based compression problem, which requests for a given string to find a smallest context-free grammar deriving the string, is presented. For the input length n and an optimum CFG size g, the algorithm consumes only O(g log g) space and O(n log∗n) time to achieve O((log∗n) logn) approximation ratio to the optimum compression, where log∗n i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISPRS International Journal of Geo-Information
سال: 2020
ISSN: 2220-9964
DOI: 10.3390/ijgi9120721